#define _CRT_SECURE_NO_WARNINGS 1

#include "my_s_queue.h"
#include "my_list.h"

void test()
{
	my_s_qu::stack<int,  vector<int>> n;
	n.push_back(1);
	n.push_back(2);
	n.push_back(3);
	n.push_back(4);
	n.push_back(5);

	cout << n.size() << endl;
}

void test_queue()
{
	my_s_qu::queue<int, vector<int>> n;
	n.push_back(1);
	n.push_back(2);
	n.push_back(3);
	n.push_back(4);
	n.push_back(5);

	cout << n.size() << endl;
	cout << n.front() << endl;
	cout << n.size() << endl;
}



void func()
{
	int z[10] = { 1, 5, 2, 7, 23,  67, 4, 6, 1000, 54 };
	my_priority_queue::priority_queue<int, vector<int>, greater<int>>  x(z, z + sizeof(z) / sizeof(int));
	/*x.push(3);
	x.push(3);
	x.push(4);
	x.push(1);
	x.push(7);
	x.push(23);
	x.push(100);*/

	while (!x.empty())
	{
		cout << x.top() << " ";
		x.pop();
	}
	cout << endl;
}

void test_re_iterator()
{
	const my_list::list<int> x;
	/*x.push_back(1);
	x.push_back(2);
	x.push_back(3);
	x.push_back(5);
	x.push_back(6);
	x.push_back(7);*/
	 my_list::list<int>::const_reverse_iterator it = x.rbegin();
	while (it != x.rend())
	{
		cout << *it << " ";
		++it;
	}
}

int main()
{
	test_re_iterator();
	return 0;
}